Partial strategyproofness: Relaxing strategyproofness for the random assignment problem

Abstract We present partial strategyproofness, a new, relaxed notion of strategyproofness for studying the incentive properties non-strategyproof assignment mechanisms. Informally, mechanism is partially strategyproof if it makes truthful reporting dominant strategy those agents whose preference intensities differ sufficiently between any two objects. demonstrate that axiomatically motivated and yields parametric measure “how strategyproof” an is. apply this new concept to derive novel insights about probabilistic serial different variants Boston mechanism.